TSTP Solution File: NUM016^5 by Zipperpin---2.1.9999

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Zipperpin---2.1.9999
% Problem  : NUM016^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : NO INFORMATION
% Format   : NO INFORMATION
% Command  : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.kSPTPeA9Ud true

% Computer : n025.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Aug 31 12:38:58 EDT 2023

% Result   : Theorem 0.20s 0.76s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   29 (   8 unt;   6 typ;   0 def)
%            Number of atoms       :   81 (   0 equ;   0 cnn)
%            Maximal formula atoms :   22 (   3 avg)
%            Number of connectives :  273 (  41   ~;  36   |;  22   &; 174   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   19 (   6 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    7 (   7   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    7 (   6 usr;   2 con; 0-2 aty)
%            Number of variables   :   45 (   0   ^;  45   !;   0   ?;  45   :)

% Comments : 
%------------------------------------------------------------------------------
thf(prime_divisor_type,type,
    prime_divisor: $i > $i ).

thf(a_type,type,
    a: $i ).

thf(less_type,type,
    less: $i > $i > $o ).

thf(divides_type,type,
    divides: $i > $i > $o ).

thf(prime_type,type,
    prime: $i > $o ).

thf(factorial_plus_one_type,type,
    factorial_plus_one: $i > $i ).

thf(cNUM016_1,conjecture,
    ~ ( ! [X: $i] :
          ~ ( less @ X @ X )
      & ! [X: $i,Y: $i] :
          ( ~ ( less @ Y @ X )
          | ~ ( less @ X @ Y ) )
      & ! [X: $i] : ( divides @ X @ X )
      & ! [X: $i,Y: $i,Z: $i] :
          ( ( divides @ X @ Z )
          | ~ ( divides @ Y @ Z )
          | ~ ( divides @ X @ Y ) )
      & ! [X: $i,Y: $i] :
          ( ~ ( less @ Y @ X )
          | ~ ( divides @ X @ Y ) )
      & ! [X: $i] : ( less @ X @ ( factorial_plus_one @ X ) )
      & ! [X: $i,Y: $i] :
          ( ( less @ Y @ X )
          | ~ ( divides @ X @ ( factorial_plus_one @ Y ) ) )
      & ! [X: $i] :
          ( ( divides @ ( prime_divisor @ X ) @ X )
          | ( prime @ X ) )
      & ! [X: $i] :
          ( ( prime @ ( prime_divisor @ X ) )
          | ( prime @ X ) )
      & ! [X: $i] :
          ( ( less @ ( prime_divisor @ X ) @ X )
          | ( prime @ X ) )
      & ( prime @ a )
      & ! [X: $i] :
          ( ( less @ ( factorial_plus_one @ a ) @ X )
          | ~ ( less @ a @ X )
          | ~ ( prime @ X ) ) ) ).

thf(zf_stmt_0,negated_conjecture,
    ( ! [X: $i] :
        ~ ( less @ X @ X )
    & ! [X: $i,Y: $i] :
        ( ~ ( less @ Y @ X )
        | ~ ( less @ X @ Y ) )
    & ! [X: $i] : ( divides @ X @ X )
    & ! [X: $i,Y: $i,Z: $i] :
        ( ( divides @ X @ Z )
        | ~ ( divides @ Y @ Z )
        | ~ ( divides @ X @ Y ) )
    & ! [X: $i,Y: $i] :
        ( ~ ( less @ Y @ X )
        | ~ ( divides @ X @ Y ) )
    & ! [X: $i] : ( less @ X @ ( factorial_plus_one @ X ) )
    & ! [X: $i,Y: $i] :
        ( ( less @ Y @ X )
        | ~ ( divides @ X @ ( factorial_plus_one @ Y ) ) )
    & ! [X: $i] :
        ( ( divides @ ( prime_divisor @ X ) @ X )
        | ( prime @ X ) )
    & ! [X: $i] :
        ( ( prime @ ( prime_divisor @ X ) )
        | ( prime @ X ) )
    & ! [X: $i] :
        ( ( less @ ( prime_divisor @ X ) @ X )
        | ( prime @ X ) )
    & ( prime @ a )
    & ! [X: $i] :
        ( ( less @ ( factorial_plus_one @ a ) @ X )
        | ~ ( less @ a @ X )
        | ~ ( prime @ X ) ) ),
    inference('cnf.neg',[status(esa)],[cNUM016_1]) ).

thf(zip_derived_cl0,plain,
    ! [X0: $i] :
      ( ( less @ ( factorial_plus_one @ a ) @ X0 )
      | ~ ( less @ a @ X0 )
      | ~ ( prime @ X0 ) ),
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl11,plain,
    ! [X15: $i] :
      ~ ( less @ X15 @ X15 ),
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl22,plain,
    ( ~ ( prime @ ( factorial_plus_one @ a ) )
    | ~ ( less @ a @ ( factorial_plus_one @ a ) ) ),
    inference('sup-',[status(thm)],[zip_derived_cl0,zip_derived_cl11]) ).

thf(zip_derived_cl6,plain,
    ! [X6: $i] : ( less @ X6 @ ( factorial_plus_one @ X6 ) ),
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl28,plain,
    ~ ( prime @ ( factorial_plus_one @ a ) ),
    inference(demod,[status(thm)],[zip_derived_cl22,zip_derived_cl6]) ).

thf(zip_derived_cl5,plain,
    ! [X4: $i,X5: $i] :
      ( ( less @ X4 @ X5 )
      | ~ ( divides @ X5 @ ( factorial_plus_one @ X4 ) ) ),
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl4,plain,
    ! [X3: $i] :
      ( ( divides @ ( prime_divisor @ X3 ) @ X3 )
      | ( prime @ X3 ) ),
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl49,plain,
    ! [X0: $i] :
      ( ( less @ X0 @ ( prime_divisor @ ( factorial_plus_one @ X0 ) ) )
      | ( prime @ ( factorial_plus_one @ X0 ) ) ),
    inference('sup+',[status(thm)],[zip_derived_cl5,zip_derived_cl4]) ).

thf(zip_derived_cl3,plain,
    ! [X2: $i] :
      ( ( prime @ ( prime_divisor @ X2 ) )
      | ( prime @ X2 ) ),
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl0_001,plain,
    ! [X0: $i] :
      ( ( less @ ( factorial_plus_one @ a ) @ X0 )
      | ~ ( less @ a @ X0 )
      | ~ ( prime @ X0 ) ),
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl2,plain,
    ! [X1: $i] :
      ( ( less @ ( prime_divisor @ X1 ) @ X1 )
      | ( prime @ X1 ) ),
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl10,plain,
    ! [X13: $i,X14: $i] :
      ( ~ ( less @ X13 @ X14 )
      | ~ ( less @ X14 @ X13 ) ),
    inference(cnf,[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl16,plain,
    ! [X0: $i] :
      ( ( prime @ X0 )
      | ~ ( less @ X0 @ ( prime_divisor @ X0 ) ) ),
    inference('sup-',[status(thm)],[zip_derived_cl2,zip_derived_cl10]) ).

thf(zip_derived_cl35,plain,
    ( ~ ( prime @ ( prime_divisor @ ( factorial_plus_one @ a ) ) )
    | ~ ( less @ a @ ( prime_divisor @ ( factorial_plus_one @ a ) ) )
    | ( prime @ ( factorial_plus_one @ a ) ) ),
    inference('sup-',[status(thm)],[zip_derived_cl0,zip_derived_cl16]) ).

thf(zip_derived_cl28_002,plain,
    ~ ( prime @ ( factorial_plus_one @ a ) ),
    inference(demod,[status(thm)],[zip_derived_cl22,zip_derived_cl6]) ).

thf(zip_derived_cl38,plain,
    ( ~ ( prime @ ( prime_divisor @ ( factorial_plus_one @ a ) ) )
    | ~ ( less @ a @ ( prime_divisor @ ( factorial_plus_one @ a ) ) ) ),
    inference(demod,[status(thm)],[zip_derived_cl35,zip_derived_cl28]) ).

thf(zip_derived_cl42,plain,
    ( ( prime @ ( factorial_plus_one @ a ) )
    | ~ ( less @ a @ ( prime_divisor @ ( factorial_plus_one @ a ) ) ) ),
    inference('sup-',[status(thm)],[zip_derived_cl3,zip_derived_cl38]) ).

thf(zip_derived_cl28_003,plain,
    ~ ( prime @ ( factorial_plus_one @ a ) ),
    inference(demod,[status(thm)],[zip_derived_cl22,zip_derived_cl6]) ).

thf(zip_derived_cl44,plain,
    ~ ( less @ a @ ( prime_divisor @ ( factorial_plus_one @ a ) ) ),
    inference(demod,[status(thm)],[zip_derived_cl42,zip_derived_cl28]) ).

thf(zip_derived_cl72,plain,
    prime @ ( factorial_plus_one @ a ),
    inference('sup-',[status(thm)],[zip_derived_cl49,zip_derived_cl44]) ).

thf(zip_derived_cl78,plain,
    $false,
    inference(demod,[status(thm)],[zip_derived_cl28,zip_derived_cl72]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : NUM016^5 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13  % Command  : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.kSPTPeA9Ud true
% 0.13/0.34  % Computer : n025.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Fri Aug 25 08:57:52 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.13/0.34  % Running portfolio for 300 s
% 0.13/0.34  % File         : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.34  % Number of cores: 8
% 0.13/0.35  % Python version: Python 3.6.8
% 0.13/0.35  % Running in HO mode
% 0.20/0.62  % Total configuration time : 828
% 0.20/0.62  % Estimated wc time : 1656
% 0.20/0.62  % Estimated cpu time (8 cpus) : 207.0
% 0.20/0.72  % /export/starexec/sandbox/solver/bin/lams/40_c.s.sh running for 80s
% 0.20/0.72  % /export/starexec/sandbox/solver/bin/lams/35_full_unif4.sh running for 80s
% 0.20/0.73  % /export/starexec/sandbox/solver/bin/lams/40_c_ic.sh running for 80s
% 0.20/0.74  % /export/starexec/sandbox/solver/bin/lams/15_e_short1.sh running for 30s
% 0.20/0.74  % /export/starexec/sandbox/solver/bin/lams/40_noforms.sh running for 90s
% 0.20/0.75  % /export/starexec/sandbox/solver/bin/lams/40_b.comb.sh running for 70s
% 0.20/0.76  % Solved by lams/40_c.s.sh.
% 0.20/0.76  % done 40 iterations in 0.021s
% 0.20/0.76  % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 0.20/0.76  % SZS output start Refutation
% See solution above
% 0.20/0.76  
% 0.20/0.76  
% 0.20/0.76  % Terminating...
% 0.86/0.84  % Runner terminated.
% 0.86/0.85  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------